On eigenspaces of some compound signed graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On net-Laplacian Energy of Signed Graphs

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

متن کامل

Some results on semi-total signed graphs

A signed graph (or sigraph in short) is an ordered pair S = (Su, σ), where Su is a graph G = (V,E), called the underlying graph of S and σ : E → {+,−} is a function from the edge set E of Su into the set {+,−}, called the signature of S. The ×-line sigraph of S denoted by L×(S) is a sigraph defined on the line graph L(S u) of the graph Su by assigning to each edge ef of L(Su), the product of si...

متن کامل

On the Distance of Some Compound Graphs

the closely related average vertex distance jGj 2 1 d(G); are the topic of numerous contemporary mathematical researches; for some of the most recent works in this eld see [1, 4, 5, 8{12]. It was noticed some time ago that for certain classes of graphs it is possible to nd an integer m; such that the distances of all graphs from this class are congruent modulo m: The simplest such regularity is...

متن کامل

Some minor-closed classes of signed graphs

We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, projective plane, torus, and Klein bottle. We give the full list of 20 excluded minors for the smallest class and make a conjecture about the largest class.

متن کامل

Eigenspaces for Graphs

In this paper, we investigate the feasibility of using graph-based descriptions to learn the view structure of 3D objects. The graphs used in our study are constructed from the Delaunay triangulations of corner features. The investigation is divided into two parts. We commence by considering how relational structures can be encoded in a way which can be used to generate parametric eigenspaces. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2016

ISSN: 0024-3795

DOI: 10.1016/j.laa.2016.07.008